Using Battery Level as Metric for Graph Planarization
نویسندگان
چکیده
Topology control in wireless sensor networks is an important issue for scalability and energy efficiency. It is often based on graph reduction performed through the use of Gabriel Graph or Relative Neighborhood Graph. This graph reduction is usually based on geometric values. In this paper we tackle the problem of possible connectivity loss in the reduced graph by applying a battery level based reduction graph. Experiments are conducted to evaluate our proposition. Results are compared with RNG reduction which takes into account only the strength of the received signal (RSSI). Results show that our algorithm maintains network connectivity longer than solutions from the literature and balances the energy consumption over nodes.
منابع مشابه
A fuzzy genetic algorithm for automatic orthogonal graph drawing
This paper reflects results of research related to developing a new methodology for automatic graph drawing based on applying genetic algorithms. The methodology has permitted the elaboration of a hybrid technique that combines the most popular, classical, topology-shape-metric approach to orthogonal drawings on the grid and a genetic algorithm that is directed, in its evolutionary process, at ...
متن کاملOptimal k-Level Planarization and Crossing Minimization
An important step in laying out hierarchical network diagrams is to order the nodes on each level. The usual approach is to minimize the number of edge crossings. This problem is NP-hard even for two layers when the first layer is fixed. Hence, in practice crossing minimization is performed using heuristics. Another suggested approach is to maximize the planar subgraph, i.e. find the least numb...
متن کاملFixed points for Chatterjea contractions on a metric space with a graph
In this work, we formulate Chatterjea contractions using graphs in metric spaces endowed with a graph and investigate the existence of fixed points for such mappings under two different hypotheses. We also discuss the uniqueness of the fixed point. The given result is a generalization of Chatterjea's fixed point theorem from metric spaces to metric spaces endowed with a graph.
متن کاملCommon fixed point results for graph preserving mappings in parametric $N_b$-metric spaces
In this paper, we discuss the existence and uniqueness of points of coincidence and common fixed points for a pair of graph preserving mappings in parametric $N_b$-metric spaces. As some consequences of this study, we obtain several important results in parametric $b$-metric spaces, parametric $S$-metric spaces and parametric $A$-metric spaces. Finally, we provide some illustrative examples to ...
متن کاملAn Alternative Method to Crossing Minimization on Hierarchical Graphs
A common method for drawing directed graphs is, as a rst step, to partition the vertices into a set of k levels and then, as a second step, to permute the vertices within the levels such that the number of crossings is minimized. We suggest an alternative method for the second step, namely, removing the minimal number of edges such that the resulting graph is k-level planar. For the nal diagram...
متن کامل